DH 인터뷰 스터디

@VERO
Created Date · 2023년 11월 06일 13:11
Last Updated Date · 2023년 11월 08일 01:11

스터디

표현

  • I didn't hear you correctly, would you mind repeating that?
  • The time complexity is O of N .
  • I'm not sure if this will work well.
  • So best-case is that the first character is different, that would be O(1), worst-case is still O(n).